C 5 . 1 . 3 Decision Tree Discovery

نویسندگان

  • Ron Kohavi
  • Ross Quinlan
چکیده

We describe the two most commonly used systems for induction of decision trees for classi cation: C4.5 and CART. We highlight the methods and di erent decisions made in each system with respect to splitting criteria, pruning, noise handling, and other di erentiating features. We describe how rules can be derived from decision trees and point to some di erence in the induction of regression trees. We conclude with some pointers to advanced techniques, including ensemble methods, oblique splits, grafting, and coping with large data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geospatial Data Ming and Knowledge Discovery Using Decision Tree Algorithm—a Case Study of Soil Data Set of the Yellow River Delta

Copyright  1999 The Association of Chinese Professionals in GIS Abroad Geoinformatics and Socioinformatics 151 Hilgard Hall, University of California, Berkeley, CA 94720-3110, USA The Proceedings of Geoinformatics'99 Conference All rights reserved. ISBN 0-9651441-3-5 Ann Arbor, 19-21 June, 1999, pp. 1-8 Printed in Ann Arbor, Michigan GEOSPATIAL DATA MING AND KNOWLEDGE DISCOVERY USING DECISION ...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

X iv : c s . C C / 0 50 80 71 v 1 1 6 A ug 2 00 5 Every decision tree has an influential variable

We prove that for any decision tree calculating a boolean function f : {−1, 1}n → {−1, 1},

متن کامل

C / 0 50 80 71 v 1 1 6 A ug 2 00 5 Every decision tree has an influential variable

We prove that for any decision tree calculating a boolean function f : {−1, 1}n → {−1, 1},

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001